#include <iostream>
#include <vector>
#include <unordered_set>
#include <algorithm>
using namespace std;
class Solution
{
public:
    int intersectionSizeTwo(vector<vector<int>> &intervals)
    {
        sort(intervals.begin(), internal.end());
        vector<int> ret = internals[0];
        for (size_t i = 1; i < intervals.size(); i++)
        {
            if (intervals[i][1] <)
            {
                /* code */
            }
        }
    }
};
int main()
{

    system("pause");
    return 0;
}
